Transitive partitions in realizations of tournament score sequences
نویسندگان
چکیده
A tournament is an oriented complete graph, and one containing no directed cycles is called transitive. A tournament T= (V,A) is called m-partition transitive if there is a partition V=X1∪· X2∪· · · ·∪· Xm such that the subtournaments induced by each Xi are all transitive, and T Contract grant sponsor: University of Dayton Research Council (to A. H. B.); Contract grant sponsor: National Science Foundation (NSF); Contract grant number: DMS-0500951 (to G. C.). Journal of Graph Theory 2009 Wiley Periodicals, Inc.
منابع مشابه
Pan-partition Transitive Realizations
A tournament is an oriented complete graph. There are many conditions that assure that a non increasing sequence s1 ≥ s2 ≥ ... ≥ sn are the scores (out degrees) of the vertices of a tournament. Furthermore, given a realizable score sequence, there are possibly many tournaments that have that sequence as its score sequence. In this paper we explore the existence of realizations of a sequence hav...
متن کاملShort Score Certificates for Upset Tournaments
A score certificate for a tournament, T , is a collection of arcs of T which can be uniquely completed to a tournament with the same scorelist as T ’s, and the score certificate number of T is the least number of arcs in a score certificate of T . Upper bounds on the score certificate number of upset tournaments are derived. The upset tournaments on n vertices are in one–to–one correspondence w...
متن کاملPACKING AND DECOMPOSITIONS IN TRANSITIVE TOURNAMENTS – PhD THESIS
In this thesis we shall deal with oriented graphs. The motivation for us is a result by Sali and Simonyi (see also a short proof by Gyárfás) where the existence of the decomposition of transitive tournaments on two isomorphic graphs is shown. In this thesis we start to study a problem of packing in transitive tournaments and we consider decompositions and partitions of transitive tournaments. T...
متن کامل2-Partition-Transitive Tournaments
Given a tournament score sequence s1 s2 } } } sn , we prove that there exists a tournament T on vertex set [1, 2, ..., n] such that the degree of any vertex i is si and the subtournaments of T on both the even and the odd vertices are transitive in the given order. This means that i beats j whenever i< j and i# j (mod 2). For any score sequence, we give an algorithm to construct a tournament of...
متن کاملLandau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
Ao and Hanson, and Guiduli, Gy arf as, Thomass e and Weidl independently, proved the following result: For any tournament score sequence S = (s1; s2; : : : ; sn) with s1 s2 sn, there exists a tournament T on vertex set f1; 2; : : :; ng such that the score of each vertex i is si and the sub-tournaments of T on both the even and the odd indexed vertices are transitive in the given order; that is,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 64 شماره
صفحات -
تاریخ انتشار 2010